Mathematical Morphological Distributive Concepts over Unions and Intersections
نویسندگان
چکیده
منابع مشابه
Compressed bitmap indexes: beyond unions and intersections
Compressed bitmap indexes are used to speed up simple aggregate queries in databases. Indeed, set operations like intersections, unions and complements can be represented as logical operations (AND,OR, NOT) that are ideally suited for bitmaps. However, it is less obvious how to apply bitmaps to more advanced queries. For example, we might seek products in a store that meet some, but maybe not a...
متن کاملUnions and Intersections of Leray Complexes
A simplicial complex X is d-Leray if H̃i(Y ;Q) = 0 for all induced subcomplexes Y ⊂ X and i ≥ d. Let L(X) denote the minimal d such that X is d-Leray. Theorem: Let X,Y be simplicial complexes on the same vertex set. Then L(X ∩ Y ) ≤ L(X) + L(Y ) , L(X ∪ Y ) ≤ L(X) + L(Y ) + 1 .
متن کاملIntersections and Unions of Session Types
Prior work has extended the deep, logical connection between the linear sequent calculus and sessiontyped message-passing concurrent computation with equi-recursive types and a natural notion of subtyping. In this paper, we extend this further by intersection and union types in order to express multiple behavioral properties of processes in a single type. We prove session fidelity and absence o...
متن کاملE ective Randomness of Unions and Intersections
We investigate the -randomness of unions and intersections of random sets under various notions of randomness corresponding to di erent probability measures. For example, the union of two relatively MartinL of random sets is not Martin-L of random but is random with respect to the Bernoulli measure 3 4 under which any number belongs to the set with probability 3 4 . Conversely, any 3 4 random...
متن کاملUntangling Typechecking of Intersections and Unions
Intersection and union types denote conjunctions and disjunctions of properties. Using bidirectional typechecking, intersection types are relatively straightforward, but union types present challenges. For union types, we can case-analyze a subterm of union type when it appears in evaluation position (replacing the subterm with a variable, and checking that term twice under appropriate assumpti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Pure Mathematics
سال: 2016
ISSN: 2160-0368,2160-0384
DOI: 10.4236/apm.2016.610052